Lebesgue constants in polynomial interpolation

نویسندگان

  • Simon J. Smith
  • S. J. Smith
چکیده

Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the “nodes”). However, the accuracy of the approximation is greatly influenced by the location of these nodes. Now, a useful way to measure a given set of nodes to determine whether its Lagrange polynomials are likely to provide good approximations is by means of the Lebesgue constant. In this paper a brief survey of methods and results for the calculation of Lebesgue constants for some particular node systems is presented. These ideas are then discussed in the context of Hermite–Fejér interpolation and a weighted interpolation method where the nodes are zeros of Chebyshev polynomials of the second kind.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lebesgue functions and Lebesgue constants in polynomial interpolation

The Lebesgue constant is a valuable numerical instrument for linear interpolation because it provides a measure of how close the interpolant of a function is to the best polynomial approximant of the function. Moreover, if the interpolant is computed by using the Lagrange basis, then the Lebesgue constant also expresses the conditioning of the interpolation problem. In addition, many publicatio...

متن کامل

Lebesgue Constants and Optimal Node Systems via Symbolic Computations

Polynomial interpolation is a classical method to approximate continuous functions by polynomials. To measure the correctness of the approximation, Lebesgue constants are introduced. For a given node system X = {x1 < . . . < xn+1} (xj ∈ [a, b]), the Lebesgue function λn(x) is the sum of the modulus of the Lagrange basis polynomials built on X. The Lebesgue constant Λn assigned to the function λ...

متن کامل

New bounds on the Lebesgue constants of Leja sequences on the unit disc and their projections R-Leja sequences

Motivated by the development of non-intrusive interpolation methods for parametric PDE’s in high dimension, we have introduced in [8] a sparse multi-variate polynomial interpolation procedure based on the Smolyak formula. The evaluation points lie in an infinite grid ⊗j=0Z where Z = (zj)j≥0 is any infinite sequence of mutually distinct points in some compact X in R or C. A key aspect of the int...

متن کامل

Stability inequalities for Lebesgue constants via Markov-like inequalities

We prove that L∞-norming sets for finite-dimensional multivariate function spaces on compact sets are stable under small perturbations. This implies stability of interpolation operator norms (Lebesgue constants), in spaces of algebraic and trigonometric polynomials. 2010 AMS subject classification: 41A10, 41A63, 42A15, 65D05.

متن کامل

Interpolation points and interpolation formulae on the square

The problem of choosing " good " nodes on a given compact set is a central one in multivariate polynomial interpolation. Besides unisolvence, which is by no means an easy problem, for practical purposes one needs slow growth of the Lebesgue constant and computational efficiency. In this talk, we present new sets of nodes recently studied for polynomial interpolation on the square that are asymp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007